Classic Nintendo Games are (NP-)Hard
نویسندگان
چکیده
We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokémon. Our results apply to Super Mario Bros. 1, 3, Lost Levels, and Super Mario World; Donkey Kong Country 1–3; all Legend of Zelda games except Zelda II: The Adventure of Link; all Metroid games; and all Pokémon role-playing games. For Mario and Donkey Kong, we show NP-completeness. In addition, we observe that several games in the Zelda series are PSPACE-complete.
منابع مشابه
Classic Nintendo Games Are (Computationally) Hard
We prove NP-hardness results for five of Nintendo’s largest video game franchises: Mario, Donkey Kong, Legend of Zelda, Metroid, and Pokémon. Our results apply to generalized versions of Super Mario Bros. 1–3, The Lost Levels, and Super Mario World; Donkey Kong Country 1–3; all Legend of Zelda games; all Metroid games; and all Pokémon role-playing games. In addition, we prove PSPACE-completenes...
متن کاملCollecting Things Under Time Pressure is Hard
We establish a scheme for showing the NP-Hardness of games with certain common mechanics including movement in three dimensions subject to gravity, ‘gathering’ items by co-locating with them, and having this collection process be subject to a time-limit. The Chinese Postman Problem (CPP) is the following: Given a mixed graph M = (V,E,A) with a cost function c defined on E ∪A, and an integer k, ...
متن کاملPerfect Recall and Pruning in Games withImperfect
Games with imperfect information are an interesting and important class of games. They include most card games (e.g., bridge and poker), as well as many economic and political models. Here, we investigate algorithms for solving imperfect information games expressed in their extensive (game-tree) form. In particular, we consider algorithms for the simplest form of solution | a pure-strategy equi...
متن کاملPerfect Recall and Pruning in Games with Imperfect Information
Games with imperfect information are an interesting and important class of games. They include most card games (e.g., bridge and poker) as well as many economic and political models. Here we investigate algorithms for finding the simplest form of a solution (a pure-strategy equilibrium point) to imperfect information games expressed in their extensive (game tree) form. We introduce to the artif...
متن کاملComputational Complexity of Weighted Threshold Games
Weighted threshold games are coalitional games in which each player has a weight (intuitively corresponding to its voting power), and a coalition is successful if the sum of its weights exceeds a given threshold. Key questions in coalitional games include finding coalitions that are stable (in the sense that no member of the coalition has any rational incentive to leave it), and finding a divis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1203.1895 شماره
صفحات -
تاریخ انتشار 2012